On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem
نویسندگان
چکیده
منابع مشابه
On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem
We study hardness of approximating several minimaximal and maximinimal NP-optimization problems related to the minimum linear ordering problem (MINLOP). MINLOP is to find a minimum weight acyclic tournament in a given arc-weighted complete digraph. MINLOP is APX-hard but its unweighted version is polynomial time solvable. We prove that, MIN-MAX-SUBDAG problem, which is a generalization of MINLO...
متن کاملOn the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems
We show improved NP-hardness of approximating Ordering Constraint Satisfaction Problems (OCSPs). For the two most well-studied OCSPs, MAXIMUM ACYCLIC SUBGRAPH and MAXIMUM BETWEENNESS, we prove NP-hard approximation factors of 14 15 + ε and 1 2 + ε . When it is hard to approximate an OCSP by a constant better than taking a uniformly-at-random ordering, then the OCSP is said to be approximation r...
متن کاملApproximating Minimum Linear Ordering Problems
This paper addresses the Minimum Linear Ordering Problem (MLOP): Given a nonnegative set function f on a finite set V , find a linear ordering on V such that the sum of the function values for all the suffixes is minimized. This problem generalizes well-known problems such as the Minimum Linear Arrangement, Min Sum Set Cover, Minimum Latency Set Cover, and Multiple Intents Ranking. Extending a ...
متن کاملNp-hardness of Some Linear Control Design Problems
We show that some basic linear control design problems are NP-hard, implying that, unless P=NP, they cannot be solved by polynomial time algorithms. The problems that we consider include simultaneous stabilization by output feedback, stabilization by state or output feedback in the presence of bounds on the elements of the gain matrix, and decentralized control. These results are obtained by fi...
متن کاملOn Approximability of Linear Ordering and Related NP-optimization Problems on Graphs (Extended Abstract)
We investigate the approximability of minimum and maximum linear ordering problems (MIN-LOP and MAX-LOP) and related feedback set problems such as maximum weight acyclic subdiagraph (MAX-W-SUBDAG), minimum weight feedback arc/vertex set (MIN-W-FAS/ MIN-W-FVS) and a generalization of the latter called MIN-Subset-FAS/MIN-Subset-FVS. MAX-LOP and the other problems have been studied by many researc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 2001
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita:2001121